Application of lattice reduction block Korkin-Zolotarev method to MIMO-decoding
نویسنده
چکیده
This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for different value of the block size and detecting by SIC.
منابع مشابه
The implementation of the parallel shortest vector enumerate in the block Korkin-Zolotarev method
This article present a parallel CPU implementation of Kannan algorithm for solving shortest vector problem in Block Korkin-Zolotarev lattice reduction method. Implementation based on Native POSIX Thread Library and show linear decrease of runtime from number of threads.
متن کاملShort review of lattice basis reduction types and his applications. (Russian)
This article presets a review of lattice lattice basis reduction types. Paper contains the main five types of lattice basis reduction: size reduced (weak Hermit), c-reduced, Lovasz condition, Hermit-Korkin-Zolotarev, Minkowski reduced. The article provides references to applications in: information theory (decoding of coding group in MIMO), calculus (minimize of the positive quadratic form), co...
متن کاملBlock Korkin{zolotarev Bases and Successive Minima
Let b 1 : : : b m 2 IR n be an arbitrary basis of lattice L that is a block Korkin{Zolotarev basis with block s i z e and let i (L) denote the successive minima of lattice L. and we present b l o c k Korkin{Zolotarev lattice bases for which this bound is tight. We i m p r o ve the Nearest Plane Algorithm of Babai (1986) using block Korkin{Zolotarev bases. Given a block Korkin{Zolotarev basis b ...
متن کاملUpper and lower bound on the cardinality containing shortest vectors in a lattice reduced by block Korkin-Zolotarev method (Russian)
This article present a concise estimate of upper and lower bound on the cardinality containing shortest vector in a lattice reduced by block Korkin-Zolotarev method (BKZ) for different value of the block size. Paper show how density affect to this cardinality, in form of the ratio of shortest vector size and sucessive minimal. Moreover we give upper estimate of cardinality for critical and Gold...
متن کاملOn the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained based on a decoding algorithm which is an improved version of Kannan’s method. The latter is currently the fastest known method for the decoding of a general lattice. For the decoding of a point x, the proposed algorithm rec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1405.3599 شماره
صفحات -
تاریخ انتشار 2014